Unconditional Lower Bounds against Advice
نویسندگان
چکیده
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including: 1. For any constant c, NEXP 6⊆ P c]/nc 2. For any constant c, MAEXP 6⊆ MA/nc 3. BPEXP 6⊆ BPP/n It was previously unknown even whether NEXP ⊆ NP/n. For the probabilistic classes, no lower bounds for uniform exponential time against advice were known before. We also consider the question of whether these lower bounds can be made to work on almost all input lengths rather than on infinitely many. We give an oracle relative to which NEXP ⊆ i.o.NP, which provides evidence that this is not possible with current techniques.
منابع مشابه
Some Results on Circuit Lower Bounds and Derandomization of Arthur-Merlin Problems
We prove a downward separation for Σ2-time classes. Specifically, we prove that if Σ2E does not have polynomial size non-deterministic circuits, then Σ2SubEXP does not have fixed polynomial size nondeterministic circuits. To achieve this result, we use Santhanam’s technique [16] on augmented Arthur-Merlin protocols defined by Aydinlioğlu and van Melkebeek [1]. We show that augmented ArthurMerli...
متن کاملUniform Circuits, Lower Bounds, and QBF Algorithms
We explore the relationships between circuit complexity, the complexity of generating circuits, and circuit-analysis algorithms. Our results can be roughly divided into three parts: • Lower Bounds Against Medium-Uniform Circuits. Informally, a circuit class is “medium uniform” if it can be generated by an algorithmic process that is somewhat complex but not infeasible. We prove several uncondit...
متن کاملComplexity and its Application to Lower Bounds on Branching Program
Multiparty communication complexity was first defined by Chandra, Furst, and Lipton [6] and used to obtain lower bounds on branching programs. Since then it has been used to get additional lower bounds and tradeoffs for branching programs [1, 3], lower bounds on problems in data structures [3], time-space tradeoffs for restricted Turing machines [1], and unconditional pseudorandom generators fo...
متن کاملA Proof of the André - Oort Conjecture via Mathematical Logic
INTRODUCTION Extending work of Bombieri and Pila on counting lattice points on convex curves [3], Pila and Wilkie proved a strong counting theorem on the number of rational points in a more general class of sets definable in an o-minimal structure on the real numbers [37]. Following a strategy proposed by Zannier, the Pila-Wilkie upper bound has been leveraged against Galois-theoretic lower bou...
متن کاملTime Space Tradeoffs for Attacks against One-Way Functions and PRGs
We study time space tradeoffs in the complexity of attacks against one-way functions and pseudorandom generators. Fiat and Naor [7] show that for every function f : [N ]→ [N ], there is an algorithm that inverts f everywhere using (ignoring lower order factors) time, space and advice at most N. We show that an algorithm using time, space and advice at most max{ 5 4N 3 4 , √ N} exists that inver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 16 شماره
صفحات -
تاریخ انتشار 2009